Search results for "adaptive memory"
showing 7 items of 7 documents
Memory CD8+ T Cell Protection From Viral Reinfection Depends on Interleukin-33 Alarmin Signals
2019
Memory CD8+ cytotoxic T lymphocytes (CTLs) can protect against viral reinfection. However, the signals driving rapid memory CTL reactivation have remained ill-defined. Viral infections can trigger the release of the alarmin interleukin-33 (IL-33) from non-hematopoietic cells. IL-33 signals through its unique receptor ST2 to promote primary effector expansion and activation of CTLs. Here, we show that the transcription factor STAT4 regulated the expression of ST2 on CTLs in vitro and in vivo in primary infections with lymphocytic choriomeningitis virus (LCMV). In the primary antiviral response, IL-33 enhanced effector differentiation and antiviral cytokine production in a CTL-intrinsic manne…
Principles of scatter search
2006
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first proposed in the 1970s, based on formulations dating back to the 1960s for combining decision rules and problem constraints. In contrast to other evolutionary methods like genetic algorithms, scatter search is founded on the premise that systematic designs and methods for creating new solutions afford significant benefits beyond those derived from recourse to randomization. It uses strategies for search diversification and intensification that have proved effective in a variety of optimization problems. This paper provides…
Scatter Search and Path Relinking: Foundations and Advanced Designs
2004
Scatter Search and its generalized form Path Relinking, are evolutionary methods that have been successfully applied to hard optimization problems. Unlike genetic algorithms, they operate on a small set of solutions and employ diversification strategies of the form proposed in Tabu Search, which give precedence to strategic learning based on adaptive memory, with limited recourse to randomization. The fundamental concepts and principles were first proposed in the 1970s as an extension of formulations, dating back to the 1960s, for combining decision rules and problem constraints. (The constraint combination approaches, known as surrogate constraint methods, now independently provide an impo…
Adaptive memory programing for the robust capacitated international sourcing problem
2008
The International Sourcing Problem consists of selecting a subset from an available set of potential suppliers internationally located. The selected suppliers must meet the demand for items from a set of plants, which are also located worldwide. Since the costs are affected by macroeconomic conditions in the countries where the supplier and the plant are located, the formulation considers the uncertainty associated with changes in these conditions. We formulate the robust capacitated international sourcing problem by means of a scenario-optimization approach. When dealing with uncertainty, one of the most common approaches in the literature is to formulate the problem via a set of possible …
Adaptive memory programming for constrained global optimization
2010
The problem of finding a global optimum of a constrained multimodal function has been the subject of intensive study in recent years. Several effective global optimization algorithms for constrained problems have been developed; among them, the multi-start procedures discussed in Ugray et al. [1] are the most effective. We present some new multi-start methods based on the framework of adaptive memory programming (AMP), which involve memory structures that are superimposed on a local optimizer. Computational comparisons involving widely used gradient-based local solvers, such as Conopt and OQNLP, are performed on a testbed of 41 problems that have been used to calibrate the performance of su…
Adaptive memory programming for the dynamic bipartite drawing problem
2020
Abstract The bipartite drawing problem is a well-known NP-hard combinatorial optimization problem with numerous applications. The aim is to minimize the number of edge crossings in a two-layer graph, in which the edges are drawn as straight lines. We consider the dynamic variant of this problem, called the dynamic bipartite drawing problem (DBDP), which consists of adding (resp. or removing) vertices and edges to (resp. or from) a given bipartite drawing, thereby obtaining a new drawing with a layout similar to that of the original drawing. To solve this problem, we propose a tabu search method that incorporates adaptive memory to search the solution space efficiently. In this study, we com…
The role of novelty detection in food memory
2010
International audience; Memory plays a central role in food choice. Recent studies focusing on food memory in everyday eating and drinking behaviour used a paradigm based on incidental learning of target foods and unexpected memory testing, demanding recognition of the target among distractors, which deviate slightly from the target. Results question the traditional view of memory as reactivation of previous experiences. Comparison of data from several experiments shows that in incidentally learned memory, distractors are rejected, while original targets are not recognised better than by chance guessing. Food memory is tuned at detecting novelty and change, rather than at recognising a prev…